array algorithmの例文

• Hashed Array Tree ( HAT ) is a dynamic array algorithm published by Sitarski in 1996.
• Brodnik et al . presented a dynamic array algorithm with a similar space wastage profile to hashed array trees.
• Goodrich presented a dynamic array algorithm called " Tiered Vectors " that provided O ( n 1 / 2 ) performance for order preserving insertions or deletions from the middle of the array.
• One should also note that in using the calculated operation ratios to the sieve range, it must be less than about 0.2587 in order to be faster than the often compared sieve of Atkin "'if the operations take approximately the same time each in CPU clock cycles "', which is a reasonable assumption for the one huge bit array algorithm.